Improving Generalized Discrete Fourier Transform (GDFT) Filter Banks with Low-Complexity and Reconfigurable Hybrid Algorithm

Oversampled Windowed Fourier Transform and Filter Banks

Efficient Subband Adaptive Filtering with Oversampled Gdft Filter Banks

This paper addresses the numerical efficiency of adaptive filtering implemented in subbands. Our approach first focuses on oversampled GDFT filter banks and their potential benefits over other possible subband decompositions. Although the subband filters presented use complex arithmetic, the discussed method allows factorization into a real valued polyphase network, followed by a complex GDFT m...

Computational Complexity of Discrete Fourier Transform

A mathematical theory on the computational complexity of the Discrete Fourier Transform (DFT) is required, independently of any kind of known Fast Fourier Transform (FFT) algorithm.

Reconfigurable Filter Banks for Software Defined Radio Receivers – An Alternative Low Complexity Design to Conventional DFT Filter Banks

A new approach to implement computationally efficient reconfigurable filter banks for software defined radio receivers is presented in this paper. If the coefficients of a finite impulse response (FIR) filter are decimated by M, i.e., if every M-th coefficient of the filter is kept unchanged and remaining coefficients are replaced by zeros, a multi-band frequency response will be obtained. The ...

Hybrid Discrete Wavelet Transform and Gabor Filter Banks Processing for Features Extraction from Biomedical Images

A new methodology for automatic feature extraction from biomedical images and subsequent classification is presented. The approach exploits the spatial orientation of high-frequency textural features of the processed image as determined by a two-step process. First, the two-dimensional discrete wavelet transform (DWT) is applied to obtain the HH high-frequency subband image. Then, a Gabor filte...